#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read()
{
	LL x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    if(n%2==0) for(LL i=n;i>=1;i--) cout<<i<<" ";
    else if(n&1){
        for(LL i=n;i>=1;i--){
            if(i==(n+1)/2) continue;
            cout<<i<<" ";
        }
        cout<<(n+1)/2;
    }
    cout<<endl;
  }
return 0;
}
